// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n,x,k=0;
		cin>>n;
		vector<vector<int>> v(n+1);
		string s;
		for(int i=0;i<=n-1;i++)v[i].push_back(0);
		while(cin>>s)
		{	
			if(s=="add")
			{
				cin>>x;
				v[0].push_back(x);
				k++;
			}
			if(s=="sync")
			{
				cin>>x;
				if(v[x].size()<v[0].size())
				{
					for(int i=0; i<=k; i++)
					{
						if(v[0][i]==*(v[x].end()-1))
						{
							v[x].push_back(v[0][i+1]);
							break;
						}
					}
				}	
			}
			if(s=="query")
			{
				int mn=INT_MAX;
				for(int i=1;i<=n-1;i++)
				{
					
					mn=min(mn,(int)v[i].size()-1);
				}
				cout<<mn<<endl;
			}
		}
	}
	return 0;
}
